Optimal Control of a Two-stage Tandem Queuing System with Flexible Servers

نویسندگان

  • HYUN-SOO AHN
  • IZAK DUENYAS
  • MARK E. LEWIS
چکیده

We consider the optimal control of two parallel servers in a two-stage tandem queuing system with two flexible servers+ New jobs arrive at station 1, after which a series of two operations must be performed before they leave the system+ Holding costs are incurred at rate h1 per unit time for each job at station 1 and at rate h2 per unit time for each job at station 2+ The system is considered under two scenarios; the collaborative case and the noncollaborative case+ In the prior, the servers can collaborate to work on the same job, whereas in the latter, each server can work on a unique job although they can work on separate jobs at the same station+ We provide simple conditions under which it is optimal to allocate both servers to station 1 or 2 in the collaborative case+ In the noncollaborative case, we show that the same condition as in the collaborative case guarantees the existence of an optimal policy that is exhaustive at station 1+ However, the condition for exhaustive service at station 2 to be optimal does not carry over+ This case is examined via a numerical study+ Probability in the Engineering and Informational Sciences, 16, 2002, 453–469+ Printed in the U+S+A+

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Control of Flexible Servers in Two Tandem Queues with Operating Costs

We consider two-stage tandem queuing systems with dedicated servers in each station and flexible servers that can serve in both stations. We assume exponential service times, linear holding costs, and operating costs incurred by the servers at rates proportional to their speeds. Under conditions that ensure the optimality of nonidling policies, we show that the optimal allocation of flexible se...

متن کامل

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

متن کامل

State Dependent Multi channel Queuing System with Ordered Entry

In the present study, we analyze the multi-channel service system with ordered entryfrom finite-source and finite-storage at each channel. The arrival and service rates are assumedto be state dependent. The steady state probabilities of the system are obtained by usingChapmann-Kolmogorov equations. Some other performance indices viz. utilization of servers,expected number of units in the system...

متن کامل

A Complete Solution for the Optimal Stochastic Scheduling of a Two-stage Tandem Queue with Two Flexible Servers

We consider a two-stage tandem queue with two parallel servers and two queues. We assume that initially all jobs are present and that no further arrivals take place at any time. The two servers are identical and can serve both types of job. The processing times are exponentially distributed. After being served, a job of queue 1 joins queue 2, whereas a job of queue 2 leaves the system. Holding ...

متن کامل

Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm

The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002